Information in propositional proofs and algorithmic proof search
نویسندگان
چکیده
An abstract is not available for this content so a preview has been provided. Please use the Get access link above information on how to content.
منابع مشابه
Propositional Proofs via Combinatorial Geometry and the Search for Symmetry
This paper is motivated by questions of complexity and com-binatorics of proofs in the sequent calculus. We shall pay particular attention to the role that symmetry plays in these questions. We want to have combinatorial models for proofs, models that will reeect complexity phenomena as well as accommodate other kinds of mathematical structures or relationships. For interpolation in proofs such...
متن کاملPropositional proofs and reductions between NP search problems
Total NP search problems (TFNP problems) typically have their totality guaranteed by some combinatorial property. This paper proves that if there is a polynomial time Turing reduction between two TFNP problems, then there are quasipolynomial size, polylogarithmic height, constant depth, free-cut free propositional (Frege) proofs of the combinatorial property associated with the first TFNP probl...
متن کاملStructural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic
In this paper, we present a new system for proof-search in propositional intuitionistic logic from which an efficient implementation based on structural sharing is naturally derived. The way to solve the problem of formula duplication is not based on logical solutions but on an appropriate representation of sequents with a direct impact on sharing and therefore on the implementation. Then, the ...
متن کاملProof Search and Countermodel Construction in Bi-intuitionistic Propositional Logic
Bi-intuitionistic propositional logic (also known as Heyting-Brouwer logic, subtractive logic) extends intuitionistic propositional logic with a connective that is dual to implication, called coimplication. It is the logic of bi-[Cartesian closed] categories and it also has a Kripke semantics. It first got the attention of C. Rauszer who studied it in a number of papers. Later, it has been inve...
متن کاملExtracting Proofs from Tabled Proof Search
We consider the problem of model checking specifications involving co-inductive definitions such as are available for bisimulation. A proof search approach to model checking with such specifications often involves state exploration. We consider four different tabling strategies that can minimize such exploration significantly. In general, tabling involves storing previously proved subgoals and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2021
ISSN: ['1943-5886', '0022-4812']
DOI: https://doi.org/10.1017/jsl.2021.75